Sums of random polynomials with independent roots
نویسندگان
چکیده
We consider the zeros of sum independent random polynomials as their degrees tend to infinity. Namely, let p and q be two degree n, whose roots are chosen independently from probability measures μ ν in complex plane, respectively. compute limiting distribution for p+q n tends The can described by its logarithmic potential, which we show is pointwise maximum potentials ν. More generally, m when fixed Our results viewed describing a version free additive convolution theory polynomials.
منابع مشابه
On Roots of Random Polynomials
We study the distribution of the complex roots of random polynomials of degree n with i.i.d. coefficients. Using techniques related to Rice’s treatment of the real roots question, we derive, under appropriate moment and regularity conditions, an exact formula for the average density of this distribution, which yields appropriate limit average densities. Further, using a different technique, we ...
متن کاملEstimating Sums of Independent Random Variables
The paper deals with a problem proposed by Uriel Feige in 2005: if X1, . . . , Xn is a set of independent nonnegative random variables with expectations equal to 1, is it true that P ( ∑n i=1 Xi < n + 1) > 1 e ? He proved that P ( ∑n i=1Xi < n + 1) > 1 13 . In this paper we prove that infimum of the P ( ∑n i=1Xi < n + 1) can be achieved when all random variables have only two possible values, a...
متن کاملOn Classifications of Random Polynomials
Let $ a_0 (omega), a_1 (omega), a_2 (omega), dots, a_n (omega)$ be a sequence of independent random variables defined on a fixed probability space $(Omega, Pr, A)$. There are many known results for the expected number of real zeros of a polynomial $ a_0 (omega) psi_0(x)+ a_1 (omega)psi_1 (x)+, a_2 (omega)psi_2 (x)+...
متن کاملSums of powered characteristic roots count distance-independent circular sets
Significant values of a combinatorial count need not fit the recurrence for the count. Consequently, initial values of the count can much outnumber those for the recurrence. So is the case of the count, Gl(n), of distance-l independent sets on the cycle Cn, studied by Comtet for l ≥ 0 and n ≥ 1 [sic]. We prove that values of Gl(n) are nth power sums of the characteristic roots of the correspond...
متن کاملWeighted lattice polynomials of independent random variables
We give the cumulative distribution functions, the expected values, and the moments of weighted lattice polynomials when regarded as real functions of independent random variables. Since weighted lattice polynomial functions include ordinary lattice polynomial functions and, particularly, order statistics, our results encompass the corresponding formulas for these particular functions. We also ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2021
ISSN: ['0022-247X', '1096-0813']
DOI: https://doi.org/10.1016/j.jmaa.2020.124719